Discrete logarithin hash function that is collision free and one way
نویسنده
چکیده
For suitable composite modulus n and suitable base a, the discrete logarithm hash function x + ax mod n is collision free and one way if factoring n is hard. Further results on the relation between the discrete logarithm problem and factoring are given. Some complexity theory issues are considered.
منابع مشابه
A New Signature Scheme Based on Factoring and Discrete Logarithm Problems
Received 06 th June, 2012 Revised 12 th July, 2012 Accepted, 25 th July2012 In 1994, He and Kiesler proposed a digital signature scheme which was based on the factoring and the discrete logarithm problem both. Same year, Shimin-Wei modified the He-Kiesler signature scheme. In this paper, we propose an improvement of Shimin-Wei signature scheme based on factorization and discrete logarithm probl...
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کاملA New Non-MDS Hash Function Resisting Birthday Attack and Meet-in-the-middle Attack
To examine the integrity and authenticity of an IP address efficiently and economically, this paper proposes a new non-Merkle-Damgård structural (non-MDS) hash function called JUNA that is based on a multivariate permutation problem and an anomalous subset product problem to which no subexponential time solutions are found so far. JUNA includes an initialization algorithm and a compression algo...
متن کاملA Lightweight Hash Function Resisting Birthday Attack and Meet-in-the-middle Attack
To examine the integrity and authenticity of an IP address efficiently and economically, this paper proposes a new non-Merkle-Damgård structural (non-MDS) hash function called JUNA that is based on a multivariate permutation problem and an anomalous subset product problem to which no subexponential time solutions are found so far. JUNA includes an initialization algorithm and a compression algo...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کامل